Minimizing age of information with soft updates

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Age-Optimal Updates of Multiple Information Flows

In this paper, we study an age of information minimization problem, where multiple flows of update packets are sent over multiple servers to their destinations. Two online scheduling policies are proposed. When the packet generation and arrival times are synchronized across the flows, the proposed policies are shown to be (near) optimal for minimizing any timedependent, symmetric, and non-decre...

متن کامل

Minimizing the Age of the Information through Queues

In this paper, we focus on developing simple scheduling policies that can minimize the age of the information sent through multi-server queueing systems. We consider a general packet arrival process, where the generation times and arrival times of the packets are arbitrarily given. Hence, the packets may arrive in an order that is different from the order of their generation times. Further, a p...

متن کامل

Updates with Disjunctive Information : Fromsyntactical

The possible models approach (PMA) is a classical minimal change semantics for knowledge base updates, which provides an exclusive interpretation for disjunctive information in updateis. It has been recognized that the exclusive interpretation for disjunction may be problematic under some circumstances. In this paper, we investigate inclusive interpretations for disjunctions in updates from bot...

متن کامل

Minimizing Loss of Information at Competitive PLIP Algorithms for Image Segmentation with Noisy Back Ground

In this paper, two training systems for selecting PLIP parameters have been demonstrated. The first compares the MSE of a high precision result to that of a lower precision approximation in order to minimize loss of information. The second uses EMEE scores to maximize visual appeal and further reduce information loss. It was shown that, in the general case of basic addition, subtraction, or mul...

متن کامل

Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals

Age of information is a newly proposed metric that captures the freshness of information at end-users. The age measures the amount of time that elapsed since the latest information was generated at a source. In this context, we study an age minimization problem over a wireless broadcast network to keep many users updated on timely information, where only one user can be served at a time. We for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Communications and Networks

سال: 2019

ISSN: 1229-2370,1976-5541

DOI: 10.1109/jcn.2019.000034